منابع مشابه
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملA Generalization of the Characteristic Polynomial of a Graph
Given a graph G with its adjacency matrix A, the characteristic polynomial of G is defined as det(A − λI). Two graphs which have the same characteristic polynomial are called cospectral. It is known (see [2]) that there are non-isomorphic graphs which are co-spectral. In this note we consider the following generalization of the characteristic polynomial of a graph: For a graph G with adjacency ...
متن کاملEfficient Computation of the Characteristic Polynomial of a Threshold Graph
Abstract. An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chvátal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a one vertex graph by repeatedly adding either an isolated vertex or a dominating vertex, which is a vertex adjacent to all the other vertices. Thresh...
متن کاملOn the Aα-characteristic polynomial of a graph
Let G be a graph with n vertices, and let A(G) and D(G) denote respectively the adjacency matrix and the degree matrix of G. Define Aα(G) = αD(G) + (1− α)A(G) for any real α ∈ [0, 1]. The Aα-characteristic polynomial of G is defined to be det(xIn −Aα(G)) = ∑ j cαj(G)x n−j , where det(∗) denotes the determinant of ∗, and In is the identity matrix of size n. The Aα-spectrum of G consists of all r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1972
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90023-8